Probabilistic algorithmic randomness
نویسندگان
چکیده
We introduce martingales defined by probabilistic strategies, in which random bits are used to decide whether and how much to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness. Our characterization of MLrandomness partially addresses a critique of Schnorr by formulating ML randomness in terms of a computable process rather than a computably enumerable function.
منابع مشابه
Probabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملEstimating the algorithmic complexity of stock markets
Randomness and regularities in finance are usually treated in probabilistic terms. In this paper, we develop a different approach in using a non-probabilistic framework based on the algorithmic information theory initially developed by Kolmogorov (1965). We develop a generic method to estimate the Kolmogorov complexity of numeric series. This approach is based on an iterative “regularity erasin...
متن کاملLogarithmic reduction of the level of randomness in some probabilistic geometric constructions
Many of the surprising phenomena occurring in high dimensions are proved by use of probabilistic arguments, which show the existence of organized and regular structures but do not hint as to where exactly do these structures lie. It is an intriguing question whether some of them could be realized explicitly. In this paper we show that the amount of randomness used can be reduced significantly i...
متن کاملRandomness with Respect to the Signed-Digit Representation
The ordinary notion of algorithmic randomness of reals can be characterised as MartinLöf randomness with respect to the Lebesgue measure or as Kolmogorov randomness with respect to the binary representation. In this paper we study the question how the notion of algorithmic randomness induced by the signed-digit representation of the real numbers is related to the ordinary notion of algorithmic ...
متن کاملAlgorithmic randomness and physical entropy.
Algorithmic randomness provides a rigorous, entropylike measure of disorder of an individual, microscopic, definite state of a physical system. It is defined by the size (in binary digits) of the shortest message specifying the microstate uniquely up to the assumed resolution. Equivalently, algorithmic randomness can be expressed as the number of bits in the smallest program for a universal com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 78 شماره
صفحات -
تاریخ انتشار 2013